Some Properties of the Singular Words of the Fibonacci Word

نویسندگان

  • Zhi-Xiong Wen
  • Zhi-Ying Wen
چکیده

The combinatorial properties of the Fibonacci innnite word are of great interest in some aspects of mathematics and physics, such as number theory, fractal geometry, formal language, computational complexity , quasicrystals etc. In this note, we introduce the singular words of the Fibonacci innnite word and discuss their properties. We establish two decompositions of the Fibonacci word in singular words and their consequences. By using these results, we discuss the local isomorphism of the Fibonacci word and the overlap properties of the factors. Moreover, we also give new proofs for the results on special words and the power of the factors. The combinatorial properties of the Fibonacci innnite word are of great interest in some aspects of mathematics and physics, such as number theory , fractal geometry, formal language, computational complexity, quasicrys-tals etc. See 1, 3, 8, 9, 11]. Moreover, the properties of the subwords of the Fibonacci innnite word have been studied extensively by many authors 2, 4, 5, 6, 9, 10]. In this note, we shall present some new properties of the subwords of the Fibonacci word: as we shall see, the most striking of these properties is that the adjacent singular words of the same order are positively separated. This note is organized as follows. After recalling some preliminary remarks on the Fibonacci word, we introduce the singular words and discuss their elementary properties. Then we establish two decompositions of the Fibonacci word in singular words (Theorems 1 and 2) and their consequences. By using these results, we discuss the local isomorphism of the Fibonacci word (Theorem 4) and the overlap properties of the factors (Theorem 6). Moreover, we also give new proofs for the results on special words (Theorem 5) and the power of the factors (Theorem 3). In this note, we use the following deenitions and terminology. Let A = fa; bg be an alphabet of two letters, let A be the free monoid on A, and let F be the free group generated by A. The elements of A are called words. The neutral element of A is called the empty word which we denote by ". Let w be a word: we denote by jwj the length of w, we denote by jwj a

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A generalization of the Fibonacci word fractal and the Fibonacci snowflake

In this paper we introduce a family of infinite words that generalize the Fibonacci word and we study their combinatorial properties. We associate with this family of words a family of curves that are like the Fibonacci word fractal and reveal some fractal features. Finally, we describe an infinite family of polyominoes stems from the generalized Fibonacci words and we study some of their geome...

متن کامل

Collapse: A Fibonacci and Sturmian Game

We explore the properties of Collapse, a number game closely related to Fibonacci words. In doing so, we fully classify the set of periods (minimal or not) of finite Fibonacci words via careful examination of the Exceptional (sometimes called singular) finite Fibonacci words. Collapse is not a game in the Game Theory sense, but rather in the recreational sense, like the 15-puzzle (the game wher...

متن کامل

Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties

We continue our study of the class of Fibonacci-automatic words. These are infinite words whose nth term is defined in terms of a finite-state function of the Fibonacci representation of n. In this paper, we show how enumeration questions (such as counting the number of squares of length n in the Fibonacci word) can be decided purely mechanically, using a decision procedure. We reprove some kno...

متن کامل

Powers in a class of A-strict standard episturmian words

This paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic Sturmian words. In particular, we explicitly determine all integer powers occurring in such infinite words, extending recent results of Damanik and Lenz (2003), who studied powers in Sturmian words. The key tools in our analysis are canonical decompositions and a gene...

متن کامل

The Structure of Subword Graphs and Suffix Trees of Fibonacci Words

We use automata-theoretic approach to analyze properties of Fibonacci words. The directed acyclic subword graph (dawg) is a useful deterministic automaton accepting all suffixes of the word. We show that dawg’s of Fibonacci words have particularly simple structure. Our main result is a unifying framework for a large collection of relatively simple properties of Fibonacci words. The simple struc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 15  شماره 

صفحات  -

تاریخ انتشار 1994